Iterative Processing for Superposition Mapping
نویسندگان
چکیده
منابع مشابه
Iterative Decoding of Superposition Coding
Clipping is applied to superposition coding systems to reduce the peak-to-average power ratio (PAPR) of the transmitted signal. The performance limit is investigated through evaluating the mutual information driven by the induced peak-power-limited input signals. It is shown that the channel capacity can be approached by clipped superposition coding systems. To alleviate the performance degrada...
متن کاملIterative Process for an α- Nonexpansive Mapping and a Mapping Satisfying Condition(C) in a Convex Metric Space
We construct one-step iterative process for an α- nonexpansive mapping and a mapping satisfying condition (C) in the framework of a convex metric space. We study △-convergence and strong convergence of the iterative process to the common fixed point of the mappings. Our results are new and are valid in hyperbolic spaces, CAT(0) spaces, Banach spaces and Hilbert spaces, simultaneously.
متن کاملGraph-Based Bit-Wise Soft Channel Estimation for Superposition Mapping
A novel channel estimator which performs channel estimation bit-wise instead of symbol-wise is proposed in this paper. Combined with superposition mapping (SM), the proposed algorithm is able to provide multiple channel estimates for a single channel coefficient. Numerical results indicate that bit-wise soft channel estimation (BWSCE) is able to outperform symbol-wise soft channel estimation (S...
متن کاملApplication of iterative Jacobi method for an anisotropic diusion in image processing
Image restoration has been an active research area. Dierent formulations are eective in high qualityrecovery. Partial Dierential Equations (PDEs) have become an important tool in image processingand analysis. One of the earliest models based on PDEs is Perona-Malik model that is a kindof anisotropic diusion (ANDI) lter. Anisotropic diusion lter has become a valuable tool indierent elds of image...
متن کاملUsing R for Iterative and Incremental Processing
It is cumbersome to write complex machine learning and graph algorithms in existing data-parallel models like MapReduce. Many of these algorithms are, by nature, iterative and perform incremental computations, neither of which are efficiently supported by current frameworks. We argue that array-based languages, like R [1], are ideal to express these algorithms, and we should extend these langua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Electrical and Computer Engineering
سال: 2010
ISSN: 2090-0147,2090-0155
DOI: 10.1155/2010/706464